Cycles Embedding Problem in Hierarchical Hypercube Networks
نویسندگان
چکیده
The hierarchical hypercube network is suitable for massively parallel systems. The number of links in the hierarchical hypercube network forms a compromise between those of the hypercube and the cube-connected cycles. Recently, some interesting properties of the hierarchical hypercube network were investigated. Since the hierarchical hypercube is bipartite. A bipartite graph is bipancyclic if it contains cycles of every even length from 4 to |V(G)| inclusively. In this paper, we show that the hierarchical hypercube network is bipancyclic.
منابع مشابه
Hierarchical Networks Into The Hypercube
The embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings the algorithms originally developed for one architecture can be directly mapped to another architecture. This paper describes novel methods for the embedding of hierarchical interconnection networks in the hypercube to minimize the dilati...
متن کاملPancycles and Hamiltonian-Connectedness of the Hierarchical Cubic Network
We show that the hierarchical cubic network, an alternative to the hypercube, is hamiltonian-connected using Gray codes. A network is hamiltonian-connected if it contains a hamiltonian path between every two distinct nodes. In other words, a hamiltonian-connected network can embed a longest linear array between every two distinct nodes with dilation, congestion, load, and expansion equal to one...
متن کاملFinding cycles in hierarchical hypercube networks
a r t i c l e i n f o a b s t r a c t The hierarchical hypercube network, which was proposed as an alternative to the hypercube, is suitable for building a large-scale multiprocessor system. A bipartite graph G = (V , E) is bipancyclic if it contains cycles of all even lengths ranging from 4 to |V |. In this paper, we show that the hierarchical hypercube network is bipancyclic.
متن کاملHamiltonian Cycle Embedding for Fault Tolerance in Dual-cube
The hypercube has been widely used as the interconnection network (IN) in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), one more link is used for connecting to a...
متن کاملEmbedding Cube-Connected Cycles Graphs into Faulty Hypercubes
AbstructWe consider the problem of embedding a cubeconnected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a l i t of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because...
متن کامل